Bandwidth, Profile and Wavefront Reduction for Static Variable Ordering in Symbolic Model Checking
نویسنده
چکیده
In symbolic model checking, decision diagrams are used to store all reachable states of a computer program. The size of decision diagrams is highly dependent on the used variable ordering of the underlying structure, a matrix that represents transitions and variables of the system. The model checker LTSmin [16] currently uses a custom implementation to find a good variable ordering, but with this implementation LTSmin fails to produce good orderings for larger matrices. Therefore, this paper explores existing bandwidth, profile and wavefront reduction algorithms and properties, including algorithms used in the field of Structural Analysis in Civil Engineering. We will present the solution to apply existing algorithms to our rectangular matrices in symbolic model checking.
منابع مشابه
Bandwidth and Wavefront Reduction for Static Variable Ordering in Symbolic Model Checking
We demonstrate the applicability of bandwidth and wavefront reduction algorithms to static variable ordering. In symbolic model checking event locality plays a major role in time and memory usage. For example, in Petri nets event locality can be captured by dependency matrices, where nonzero entries indicate whether a transition modifies a place. The quality of event locality has been expressed...
متن کاملBandwidth and Wavefront Reduction for Static Variable Ordering in Symbolic Reachability Analysis
We investigate the use of bandwidth and wavefront reduction algorithms to determine a static BDD variable ordering. The aim is to reduce the size of BDDs arising in symbolic reachability. Previous work showed that minimizing the (weighted) event span of the variable dependency graph yields small BDDs. The bandwidth and wavefront of symmetric matrices are well studied metrics, used in sparse mat...
متن کاملOrdering symmetric sparse matrices 1 for small profile and wavefront
The ordering of large sparse symmetric matrices for small profile and wavefront or for small bandwidth is important for the efficiency of frontal and variable-band solvers. In this report, we look at the computation of pseudoperipheral nodes and compare the effectiveness of using an algorithm based on level-set structures with using the spectral method as the basis of the Reverse Cuthill-McKee ...
متن کاملEecient Ordering of State Variables and Transition Relation Partitions in Symbolic Model Checking Eecient Ordering of State Variables and Transition Relation Partitions in Symbolic Model Checking
Among the main algorithmic problems in the veriication of sequential circuits are the computation of good orders of state variables and transition relation partitions. Existing model checking packages like SMV from CMU, VIS from Berkeley or Rulebase from IBM Haifa provide variants of Rudell's sifting algorithm for the variable ordering problem and greedy-type algorithms for the partition orderi...
متن کاملA Symbolic Search Based Approach for Quantified Boolean Formulas
Solving Quantified Boolean Formulas (QBF) has become an important and attractive research area, since several problem classes might be formulated efficiently as QBF instances (e.g. planning, non monotonic reasoning, twoplayer games, model checking, etc). Many QBF solvers has been proposed, most of them perform decision tree search using the DPLL-like techniques. To set free the variable orderin...
متن کامل